Approximate binary search algorithms for mean cuts and cycles
نویسنده
چکیده
Iwano, et al. [8] have given an approximate binary search algorithm for computing max mean cuts. This paper gives a short proof of the correctness of their algorithm. It also shows how their algorithm can be dualized to an approximate binary search algorithm for computing min mean cycles that is as fast as but simpler than Orlin and Ahuja’s algorithm [12].
منابع مشابه
A Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملMulti-label cooperative cuts
Recently, a family of global, non-submodular energy functions has been proposed that is expressed as coupling edges in a graph cut. This formulation provides a rich modelling framework and also leads to efficient approximate inference algorithms. So far, the results addressed binary random variables. Here, we extend these results to the multi-label case, and combine edge coupling with move-maki...
متن کاملHybridization of Cuckoo Search and Firefly Algorithms to Calculate the Interaction Parameters in Phase Equilibrium Modeling Problems
Liquid-liquid equilibrium (LLE) problems such as phase stability analysis, phase equilibrium calculations, chemical equilibrium calculations, binary interaction parameter identification of thermodynamic models and other problems of fluid characterization have been the core subject of many recent studies. This study introduces Cuckoo Search (CS), Firefly Algorithms (FA) and its variants as p...
متن کاملAccuracy improvement of Best Scanline Search Algorithms for Object to Image Transformation of Linear Pushbroom Imagery
Unlike the frame type images, back-projection of ground points onto the 2D image space is not a straightforward process for the linear pushbroom imagery. In this type of images, best scanline search problem complicates image processing using Collinearity equation from computational point of view in order to achieve reliable exterior orientation parameters. In recent years, new best scanline sea...
متن کاملHDIdx: High-dimensional indexing for efficient approximate nearest neighbor search
Fast Nearest Neighbor (NN) search is a fundamental challenge in large-scale data processing and analytics, particularly for analyzing multimedia contents which are often of high dimensionality. Instead of using exact NN search, extensive research efforts have been focusing on approximate NN search algorithms. In this work, we present “HDIdx”, an efficient high-dimensional indexing library for f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 14 شماره
صفحات -
تاریخ انتشار 1993